Flat Cyclotomic Polynomials of Order Four and Higher

نویسنده

  • Nathan Kaplan
چکیده

In this article we prove a result about sets of coefficients of cyclotomic polynomials. We then give corollaries related to flat cyclotomic polynomials and establish the first known infinite family of flat cyclotomic polynomials of order four. We end with some questions related to flat cyclotomic polynomials of order four and five.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields

We give, over a finite field Fq, explicit factorizations into a product of irreducible polynomials, of the cyclotomic polynomials of order 3 · 2, the Dickson polynomials of the first kind of order 3 · 2 and the Dickson polynomials of the second kind of order 3 · 2 − 1.

متن کامل

Harmonic Sums and Polylogarithms Generated by Cyclotomic Polynomials

The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin transforms of Poincaré– iterated integrals including denominators of higher cyclotomic polynomials. We derive the cyclotomic harmonic polylogarithms and harmo...

متن کامل

Single polynomials that correspond to pairs of cyclotomic polynomials with interlacing zeros

We give a complete classification of all pairs of cyclotomic polynomials whose zeros interlace on the unit circle, making explicit a result essentially contained in work of Beukers and Heckman. We show that each such pair corresponds to a single polynomial from a certain special class of integer polynomials, the 2-reciprocal discbionic polynomials. We also show that each such pair also correspo...

متن کامل

Calculating cyclotomic polynomials

We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perform using the fast Fourier transform. The second algorithm calculates Φn(z) as a quotient of products of sparse power series. These two algorithms, described in detail in the paper, were used to calculate cyclotomic polynomials of ...

متن کامل

Ducci-sequences and cyclotomic polynomials

We study Ducci-sequences using basic properties of cyclotomic polynomials over F2. We determine the period of a given Ducci-sequence in terms of the order of a polynomial, and in terms of the multiplicative orders of certain elements in finite fields. We also compute some examples and study links between Duccisequences, primitive polynomials and Artin’s conjecture on primitive roots. © 2005 Els...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010